Probabilities of Boolean Functions given by Random Implicational Formulas
نویسندگان
چکیده
منابع مشابه
Probabilities of Boolean Functions given by Random Implicational Formulas
We study the asymptotic relation between the probability and the complexity of Boolean functions in the implicational fragment which are generated by large random Boolean expressions involving variables and implication, as the number of variables tends to infinity. In contrast to models studied in the literature so far, we consider two expressions to be equal if they differ only in the order of...
متن کاملThe fraction of large random trees representing a given Boolean function in implicational logic
We consider the logical system of Boolean expressions built on the single connector of implication and on positive literals. Assuming all expressions of a given size to be equally likely, we prove that we can define a probability distribution on the set of Boolean functions expressible in this system. Then we show how to approximate the probability of a function f when the number of variables g...
متن کاملThe Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function
Among their many uses, growth processes (probabilistic amplification), were used for constructing reliable networks from unreliable components, and deriving complexity bounds of various classes of functions. Hence, determining the initial conditions for such processes is an important and challenging problem. In this paper we characterize growth processes by their initial conditions and derive c...
متن کاملThe number of Boolean functions computed by formulas of a given size
Estimates are given of the number B(n; L) of distinct functions computed by propositional formulas of size L in n variables, constructed using only literals and ^; _ connectives. (L is the number of occurrences of variables. L ?1 is the number of binary ^'s and _'s. B(n; L) is also the number of functions computed by two terminal series-parallel networks with L switches.) Enroute the read-once ...
متن کاملAnd/or tree probabilities of Boolean functions
We consider two probability distributions on Boolean functions defined in terms of their representations by and/or trees (or formulas). The relationships between them, and connections with the complexity of the function, are studied. New and improved bounds on these probabilities are given for a wide class of functions, with special attention being paid to the constant function True and read-on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2012
ISSN: 1077-8926
DOI: 10.37236/2402